package leetcode;
/*
 * Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). 
 * n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). 
 * Find two lines, which together with x-axis forms a container, such that the container contains the most water.
 * Note: You may not slant the container and n is at least 2.*/
public class Container_With_Most_Water {
	public int maxArea(int[] height) {
		int i = 0,j=height.length-1,s=0;
		while(i<j) {
			int h = Math.min(height[i], height[j]);
			int l = j-i > 0 ? j-i : i-j;
			if(l*h>s) {
				s=l*h;
			}
			if(height[i]>height[j]) {
				j--;
			}else {
				i++;
			}
		}
		return s;
    }
}
